PRISM
=====
Version: 4.5.dev
Date: Sat Mar 14 16:51:02 UTC 2020
Hostname: e72bdd194fc5
Memory limits: cudd=4g, java(heap)=11g
Command line: prism -javamaxmem 11g -cuddmaxmem 4g -ii -e 5e-2 -heuristic speed -ddextraactionvars 100 -maxiters 1000000 csma.3-4.prism csma.props --property all_before_max
Parsing model file "csma.3-4.prism"...
Type: MDP
Modules: bus station1 station2 station3
Variables: b y1 y2 s1 x1 bc1 cd1 s2 x2 bc2 cd2 s3 x3 bc3 cd3
Parsing properties file "csma.props"...
5 properties:
(1) "all_before_max": Pmax=? [ !"collision_max_backoff" U "all_delivered" ]
(2) "all_before_min": Pmin=? [ !"collision_max_backoff" U "all_delivered" ]
(3) "some_before": Pmin=? [ F min_backoff_after_success<K ]
(4) "time_max": R{"time"}max=? [ F "all_delivered" ]
(5) "time_min": R{"time"}min=? [ F "all_delivered" ]
---------------------------------------------------------------------
Model checking: "all_before_max": Pmax=? [ !"collision_max_backoff" U "all_delivered" ]
Warning: Switching to sparse engine and (backwards) Gauss Seidel (default for heuristic=speed).
Building model...
Computing reachable states...
Reachability (BFS): 135 iterations in 2.05 seconds (average 0.015215, setup 0.00)
Time for model construction: 2.434 seconds.
Type: MDP
States: 1460287 (1 initial)
Transitions: 2396727
Choices: 1471059
Transition matrix: 75002 nodes (6 terminal), 2396727 minterms, vars: 51r/51c/13nd
Prob0A: 133 iterations in 3.89 seconds (average 0.029256, setup 0.00)
Prob1E: 533 iterations in 32.73 seconds (average 0.061402, setup 0.00)
yes = 710317, no = 31622, maybe = 718348
Computing remaining probabilities...
Engine: Sparse
Building quotient MDP, collapsing maximal end components as well as yes and no states...
Time for computing maximal end components: 3.381 seconds, found 0 MECs.
Time for building MEC quotient: 74.15 seconds.
Quotient MDP:
States: 718350 (1 initial)
Transitions: 1281047
Choices: 728534
Transition matrix: 286023 nodes (17 terminal), 1281047 minterms, vars: 51r/51c/65nd
Note: Interval iteration is configured to enforce monotonicity from below.
Building sparse matrix... [n=718350, nc=726132, nnz=1278645, k=3] [16.0 MB]
Creating vector for yes... [5.5 MB]
Creating vector for maybe... [5.5 MB]
Allocating iteration vectors... [4 x 5.5 MB]
TOTAL: [48.9 MB]
Starting iterations (interval iteration)...
Max relative diff between upper and lower bound on convergence: 0.0346154
Iterative method (interval iteration): 75 iterations in 2.47 seconds (average 0.020053, setup 0.97)
Value in the initial state: 0.9324677073452385
Time for model checking: 117.753 seconds.
Result: 0.9324677073452385 (value in the initial state)
Overall running time: 120.794 seconds.
---------------------------------------------------------------------
Note: There was 1 warning during computation.